On two-stage stochastic knapsack problems

On Two-Stage Stochastic Knapsack Problems with or without Probability Constraint

In this paper we study a particular version of the stochastic knapsack problem with normally distributed weights: the two-stage stochastic knapsack problem. In contrary to the single-stage knapsack problem, items can be added to or removed from the knapsack at the moment the actual weights come to be known (second stage). In addition, a probability constraint is introduced in the first stage in...

Stochastic Knapsack Problems

In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well the stochastic knapsack problem with probabilistic constraint. Special regard is given the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous problems serve...

Two-stage Stochastic Programming for Engineering Problems

The purpose of the paper is to present existing and discuss modified optimization models and solution techniques which are suitable for engineering decision-making problems containing random elements with emphasis on two decision stages. The developed approach is called two-stage stochastic programming and the paper links motivation, applicability, theoretical remarks, transformations, input da...

Complexity of two and multi-stage stochastic programming problems

Solving two-stage stochastic quadratic production planning problems

In this paper we formulate a two-stage stochastic quadratic optimization problem, that models a production planning problem of multiple products, over several time periods, with uncertain demands. This model considers quadratic inventory holding and demand backlogging recourse costs, which model the saturation phenomenon inherent to the increase of the inventory and/or backlogged demand levels....